class Solution
{
public:
	int maxProfit(vector<int>& prices)
	{
		
		int n = prices.size();
		vector<vector<int>> dp(n, vector<int>(3));
		dp[0][0] = -prices[0];
	
			14 for (int i = 1; i < n; i++)
			15 {
			16 dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i]);
			17 dp[i][1] = max(dp[i - 1][1], dp[i - 1][2]);
			18 dp[i][2] = dp[i - 1][0] + prices[i];
			19 }
		20 return max(dp[n - 1][1], dp[n - 1][2]);
		21
	}
	22
};